منابع مشابه
Average distance and vertex-connectivity
The average distance μ(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., μ(G) = ( n 2 )−1∑ {x,y}⊂V (G) dG(x, y), where V (G) denotes the vertex set of G and dG(x, y) is the distance between x and y. We prove that if G is a κ-vertex-connected graph, κ ≥ 3 an odd integer, of order n, then μ(G) ≤ n 2(κ+1) + O(1). Our bound is shown to be...
متن کاملDegree distance and edge-connectivity
Let G be a finite connected graph. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u + deg v) dG(u, v), where degw is the degree of vertex w and dG(u, v) denotes the distance between u and v in G. In this paper, we give asymptotically sharp upper bounds on the degree distance in terms of order and edge-connectivity.
متن کاملOn distance local connectivity and vertex distance colouring
In this paper, we give some sufficient conditions for distance local connectivity of a graph, and a degree condition for local connectivity of a k-connected graph with large diameter. We study some relationships between t-distance chromatic number and distance local connectivity of a graph and give an upper bound on the t-distance chromatic number of a k-connected graph with diameter d.
متن کاملOn discriminativity of vertex-degree-based indices
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
متن کاملThe vertex-connectivity of a distance-regular graph
The vertex-connectivity of a distance-regular graph equals its valency. © 2008 Dr Andries E. Brouwer. Published by Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.06.033